Improvement on the DV-hop localization algorithm based on average hop distance optimization

Abstract Wireless sensor networks, which have numerous uses in industries, attracted more attention over the past few years. Node localization is one of gordian technology to locate it. This research sought address low precision classic DV-hop algorithm context wireless networks. novel given some practical solutions this paper. The results simulations demonstrate that new method can improve accuracy and increase communication range. First all, least squares applied correct average length each hop between beacon nodes. In addition, an error distance matrix defined as intermediate variable reckon unknown node for jump select minor matrix. Finally, improved chooses minimum from previous steps modifies Simulation consequences reveal modified better enhance extend